The M/G/1 queueing model with preemptive random priorities
نویسنده
چکیده
For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when priority comes with preemption. We derived the resulting mean waiting time (which is invariant with respect to the lottery performed) and show that it lies between the corresponding means under the FCFS and the Last Come First Served with Preemption Resume (LCFS-PR) (or equivalently, the Egalitarian Processor Sharing (EPS)) schemes. We also derive an expression for the Laplace-Stieltjes transform for the time in the system in this model. Finally, we show how this priority scheme may lead to an improvement in the utilization of the server when customer decide whether or not to join.
منابع مشابه
Joint queue length distribution of multi-class, single-server queues with preemptive priorities
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.
متن کاملWaiting times in nonpreemptive M k / Gk / 1 /
This paper studies and gives an analysis of a particular queuing model. It considers a non-preemptive priority queuing system with K ( ≥ 2 ) classes of jobs. The system consists of a single processor. It represents the model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedule jobs arriving according to a Markov arrival proc...
متن کاملThe Israeli Queue with Priorities
We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numeric...
متن کاملA Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units
We study a vacation queueing system with a single server simultaneously dealing with an M/G/1 and an M/D/1 queue. Two classes of units, priority and non-priority, arrive at the system in two independent Poisson streams. Under a non-preemptive priority rule, the server provides a general service to the priority units and a deterministic service to the non-priority units. We further assume that t...
متن کاملOptimizing a priority-discipline queueing model using fuzzy set theory
The aim of this paper is to provide a more realistic description of priority-discipline queueing models by using Fuzzy Set Theory. It develops and optimizes two fuzzy queueing models with priority-discipline, a model with nonpreemptive priorities system and a model with preemptive priorities system, denoted by M̃i /M̃i /1 and M̃i /Fi /1. The first symbol is for a queueing system where arrivals and...
متن کامل